[INFO] cloning repository https://github.com/dharanad/leetcode-rs
[INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/dharanad/leetcode-rs" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fdharanad%2Fleetcode-rs", kill_on_drop: false }`
[INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fdharanad%2Fleetcode-rs'...
[INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }`
[INFO] [stdout] 17886fef1c09d1ca485db2a3a363aa73fc55e936
[INFO] checking dharanad/leetcode-rs against master#82310651b93a594a3fd69015e1562186a080d94c for pr-145770
[INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fdharanad%2Fleetcode-rs" "/workspace/builds/worker-0-tc1/source", kill_on_drop: false }`
[INFO] [stderr] Cloning into '/workspace/builds/worker-0-tc1/source'...
[INFO] [stderr] done.
[INFO] started tweaking git repo https://github.com/dharanad/leetcode-rs
[INFO] finished tweaking git repo https://github.com/dharanad/leetcode-rs
[INFO] tweaked toml for git repo https://github.com/dharanad/leetcode-rs written to /workspace/builds/worker-0-tc1/source/Cargo.toml
[INFO] validating manifest of git repo https://github.com/dharanad/leetcode-rs on toolchain 82310651b93a594a3fd69015e1562186a080d94c
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+82310651b93a594a3fd69015e1562186a080d94c" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }`
[INFO] crate git repo https://github.com/dharanad/leetcode-rs already has a lockfile, it will not be regenerated
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+82310651b93a594a3fd69015e1562186a080d94c" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] [stderr]     Blocking waiting for file lock on package cache
[INFO] [stderr]     Blocking waiting for file lock on package cache
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-0-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-0-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:7ad1b28ee6f5f7f699f6cf7015098d6ccdd96d6f2d78dd06228f5b4c9faf309c" "/opt/rustwide/cargo-home/bin/cargo" "+82310651b93a594a3fd69015e1562186a080d94c" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] [stdout] 974f715f3ef4390b7c7fed7197d26188811f827bff09e5dcad7759b8e5192536
[INFO] running `Command { std: "docker" "start" "-a" "974f715f3ef4390b7c7fed7197d26188811f827bff09e5dcad7759b8e5192536", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "974f715f3ef4390b7c7fed7197d26188811f827bff09e5dcad7759b8e5192536", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "974f715f3ef4390b7c7fed7197d26188811f827bff09e5dcad7759b8e5192536", kill_on_drop: false }`
[INFO] [stdout] 974f715f3ef4390b7c7fed7197d26188811f827bff09e5dcad7759b8e5192536
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-0-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-0-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:7ad1b28ee6f5f7f699f6cf7015098d6ccdd96d6f2d78dd06228f5b4c9faf309c" "/opt/rustwide/cargo-home/bin/cargo" "+82310651b93a594a3fd69015e1562186a080d94c" "check" "--frozen" "--all" "--all-targets" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] 1959eccaa1f563712c7e76aa86d4d33d9ad6b3988131f9a25773c0652d341d5a
[INFO] running `Command { std: "docker" "start" "-a" "1959eccaa1f563712c7e76aa86d4d33d9ad6b3988131f9a25773c0652d341d5a", kill_on_drop: false }`
[INFO] [stderr]     Checking leetcode-rs v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: unused variable: `c`
[INFO] [stdout]    --> src/main.rs:534:13
[INFO] [stdout]     |
[INFO] [stdout] 534 |         for c in word.chars() {
[INFO] [stdout]     |             ^ help: if this is intentional, prefix it with an underscore: `_c`
[INFO] [stdout]     |
[INFO] [stdout]     = note: `#[warn(unused_variables)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `c`
[INFO] [stdout]    --> src/main.rs:534:13
[INFO] [stdout]     |
[INFO] [stdout] 534 |         for c in word.chars() {
[INFO] [stdout]     |             ^ help: if this is intentional, prefix it with an underscore: `_c`
[INFO] [stdout]     |
[INFO] [stdout]     = note: `#[warn(unused_variables)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/main.rs:33:8
[INFO] [stdout]    |
[INFO] [stdout] 31 | impl ListNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 32 |     #[inline]
[INFO] [stdout] 33 |     fn new(val: i32) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/main.rs:33:8
[INFO] [stdout]    |
[INFO] [stdout] 31 | impl ListNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 32 |     #[inline]
[INFO] [stdout] 33 |     fn new(val: i32) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: multiple associated functions are never used
[INFO] [stdout]    --> src/main.rs:48:12
[INFO] [stdout]     |
[INFO] [stdout] 46  | impl Solution {
[INFO] [stdout]     | ------------- associated functions in this implementation
[INFO] [stdout] 47  |     // Link: https://leetcode.com/problems/reverse-prefix-of-word/
[INFO] [stdout] 48  |     pub fn reverse_prefix(word: String, ch: char) -> String {
[INFO] [stdout]     |            ^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 56  |     pub fn find_index(word: &str, ch: char) -> Option<usize> {
[INFO] [stdout]     |            ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 65  |     pub fn reverse(s: String, from: usize, to: usize) -> String {
[INFO] [stdout]     |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 74  |     pub fn find_max_k(nums: Vec<i32>) -> i32 {
[INFO] [stdout]     |            ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 90  |     pub fn compare_version(version1: String, version2: String) -> i32 {
[INFO] [stdout]     |            ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 124 |     pub fn num_rescue_boats(people: Vec<i32>, limit: i32) -> i32 {
[INFO] [stdout]     |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 140 |     pub fn can_rescue_all_with_boats(people: &[i32], limit: i32, max_boats: i32) -> bool {
[INFO] [stdout]     |            ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 163 |     pub fn maximum_happiness_sum(happiness: Vec<i32>, mut k: i32) -> i64 {
[INFO] [stdout]     |            ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 183 |     pub fn find_relative_ranks(score: Vec<i32>) -> Vec<String> {
[INFO] [stdout]     |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 198 |     pub fn stringfy_range(rank: usize) -> String {
[INFO] [stdout]     |            ^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 208 |     pub fn kth_smallest_prime_fraction(mut arr: Vec<i32>, k: i32) -> Vec<i32> {
[INFO] [stdout]     |            ^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 257 |     pub fn largest_local(grid: Vec<Vec<i32>>) -> Vec<Vec<i32>> {
[INFO] [stdout]     |            ^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 274 |     pub fn find_permutation_difference(s: String, t: String) -> i32 {
[INFO] [stdout]     |            ^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 287 |     pub fn find_closest_elements(arr: Vec<i32>, k: i32, x: i32) -> Vec<i32> {
[INFO] [stdout]     |            ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 302 |     pub fn num_trees(n: i32) -> i32 {
[INFO] [stdout]     |            ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 313 |     pub fn matrix_score(mut grid: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]     |            ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 352 |     pub fn two_sum(nums: Vec<i32>, target: i32) -> Vec<i32> {
[INFO] [stdout]     |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 365 |     pub fn evaluate_tree(root: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]     |            ^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 382 |     pub fn merge_trees(root1: Option<Rc<RefCell<TreeNode>>>, root2: Option<Rc<RefCell<TreeNode>>>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]     |            ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 406 |     pub fn remove_leaf_nodes(root: Option<Rc<RefCell<TreeNode>>>, target: i32) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]     |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 418 |     pub fn subsets(nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]     |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 437 |     pub fn subset_xor_sum(nums: Vec<i32>) -> i32 {
[INFO] [stdout]     |            ^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 454 |     pub fn has_path_sum(root: Option<Rc<RefCell<TreeNode>>>, target_sum: i32) -> bool {
[INFO] [stdout]     |            ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 467 |     pub fn partition(s: String) -> Vec<Vec<String>> {
[INFO] [stdout]     |            ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 475 |     fn generate_palindrom_ss(s: &[char], idx: usize, buf: &mut Vec<String>, res: &mut Vec<Vec<String>>) {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 491 |     fn is_palindrom(s: &[char]) -> bool {
[INFO] [stdout]     |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new` and `value` are never used
[INFO] [stdout]    --> src/main.rs:219:16
[INFO] [stdout]     |
[INFO] [stdout] 218 |         impl Element {
[INFO] [stdout]     |         ------------ associated items in this implementation
[INFO] [stdout] 219 |             fn new(nume: i32, denom: i32) -> Element {
[INFO] [stdout]     |                ^^^
[INFO] [stdout] ...
[INFO] [stdout] 223 |             fn value(&self) -> f32 {
[INFO] [stdout]     |                ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TrieNode` is never constructed
[INFO] [stdout]    --> src/main.rs:527:8
[INFO] [stdout]     |
[INFO] [stdout] 527 | struct TrieNode {
[INFO] [stdout]     |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `add` is never used
[INFO] [stdout]    --> src/main.rs:533:12
[INFO] [stdout]     |
[INFO] [stdout] 532 | impl TrieNode {
[INFO] [stdout]     | ------------- associated function in this implementation
[INFO] [stdout] 533 |     pub fn add(word: &str) {
[INFO] [stdout]     |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `SeatManager` is never constructed
[INFO] [stdout]    --> src/main.rs:541:8
[INFO] [stdout]     |
[INFO] [stdout] 541 | struct SeatManager {
[INFO] [stdout]     |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `reserve`, and `unreserve` are never used
[INFO] [stdout]    --> src/main.rs:546:8
[INFO] [stdout]     |
[INFO] [stdout] 544 | impl SeatManager {
[INFO] [stdout]     | ---------------- associated items in this implementation
[INFO] [stdout] 545 |
[INFO] [stdout] 546 |     fn new(n: i32) -> Self {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 556 |     fn reserve(&mut self) -> i32 {
[INFO] [stdout]     |        ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 560 |     fn unreserve(&mut self, seat_number: i32) {
[INFO] [stdout]     |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: multiple associated functions are never used
[INFO] [stdout]    --> src/main.rs:48:12
[INFO] [stdout]     |
[INFO] [stdout] 46  | impl Solution {
[INFO] [stdout]     | ------------- associated functions in this implementation
[INFO] [stdout] 47  |     // Link: https://leetcode.com/problems/reverse-prefix-of-word/
[INFO] [stdout] 48  |     pub fn reverse_prefix(word: String, ch: char) -> String {
[INFO] [stdout]     |            ^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 56  |     pub fn find_index(word: &str, ch: char) -> Option<usize> {
[INFO] [stdout]     |            ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 65  |     pub fn reverse(s: String, from: usize, to: usize) -> String {
[INFO] [stdout]     |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 74  |     pub fn find_max_k(nums: Vec<i32>) -> i32 {
[INFO] [stdout]     |            ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 90  |     pub fn compare_version(version1: String, version2: String) -> i32 {
[INFO] [stdout]     |            ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 124 |     pub fn num_rescue_boats(people: Vec<i32>, limit: i32) -> i32 {
[INFO] [stdout]     |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 140 |     pub fn can_rescue_all_with_boats(people: &[i32], limit: i32, max_boats: i32) -> bool {
[INFO] [stdout]     |            ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 163 |     pub fn maximum_happiness_sum(happiness: Vec<i32>, mut k: i32) -> i64 {
[INFO] [stdout]     |            ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 183 |     pub fn find_relative_ranks(score: Vec<i32>) -> Vec<String> {
[INFO] [stdout]     |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 198 |     pub fn stringfy_range(rank: usize) -> String {
[INFO] [stdout]     |            ^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 208 |     pub fn kth_smallest_prime_fraction(mut arr: Vec<i32>, k: i32) -> Vec<i32> {
[INFO] [stdout]     |            ^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 257 |     pub fn largest_local(grid: Vec<Vec<i32>>) -> Vec<Vec<i32>> {
[INFO] [stdout]     |            ^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 274 |     pub fn find_permutation_difference(s: String, t: String) -> i32 {
[INFO] [stdout]     |            ^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 287 |     pub fn find_closest_elements(arr: Vec<i32>, k: i32, x: i32) -> Vec<i32> {
[INFO] [stdout]     |            ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 302 |     pub fn num_trees(n: i32) -> i32 {
[INFO] [stdout]     |            ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 313 |     pub fn matrix_score(mut grid: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]     |            ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 352 |     pub fn two_sum(nums: Vec<i32>, target: i32) -> Vec<i32> {
[INFO] [stdout]     |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 365 |     pub fn evaluate_tree(root: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]     |            ^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 382 |     pub fn merge_trees(root1: Option<Rc<RefCell<TreeNode>>>, root2: Option<Rc<RefCell<TreeNode>>>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]     |            ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 406 |     pub fn remove_leaf_nodes(root: Option<Rc<RefCell<TreeNode>>>, target: i32) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]     |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 418 |     pub fn subsets(nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]     |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 437 |     pub fn subset_xor_sum(nums: Vec<i32>) -> i32 {
[INFO] [stdout]     |            ^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 454 |     pub fn has_path_sum(root: Option<Rc<RefCell<TreeNode>>>, target_sum: i32) -> bool {
[INFO] [stdout]     |            ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 467 |     pub fn partition(s: String) -> Vec<Vec<String>> {
[INFO] [stdout]     |            ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 475 |     fn generate_palindrom_ss(s: &[char], idx: usize, buf: &mut Vec<String>, res: &mut Vec<Vec<String>>) {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 491 |     fn is_palindrom(s: &[char]) -> bool {
[INFO] [stdout]     |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new` and `value` are never used
[INFO] [stdout]    --> src/main.rs:219:16
[INFO] [stdout]     |
[INFO] [stdout] 218 |         impl Element {
[INFO] [stdout]     |         ------------ associated items in this implementation
[INFO] [stdout] 219 |             fn new(nume: i32, denom: i32) -> Element {
[INFO] [stdout]     |                ^^^
[INFO] [stdout] ...
[INFO] [stdout] 223 |             fn value(&self) -> f32 {
[INFO] [stdout]     |                ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TrieNode` is never constructed
[INFO] [stdout]    --> src/main.rs:527:8
[INFO] [stdout]     |
[INFO] [stdout] 527 | struct TrieNode {
[INFO] [stdout]     |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `add` is never used
[INFO] [stdout]    --> src/main.rs:533:12
[INFO] [stdout]     |
[INFO] [stdout] 532 | impl TrieNode {
[INFO] [stdout]     | ------------- associated function in this implementation
[INFO] [stdout] 533 |     pub fn add(word: &str) {
[INFO] [stdout]     |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `SeatManager` is never constructed
[INFO] [stdout]    --> src/main.rs:541:8
[INFO] [stdout]     |
[INFO] [stdout] 541 | struct SeatManager {
[INFO] [stdout]     |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `reserve`, and `unreserve` are never used
[INFO] [stdout]    --> src/main.rs:546:8
[INFO] [stdout]     |
[INFO] [stdout] 544 | impl SeatManager {
[INFO] [stdout]     | ---------------- associated items in this implementation
[INFO] [stdout] 545 |
[INFO] [stdout] 546 |     fn new(n: i32) -> Self {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 556 |     fn reserve(&mut self) -> i32 {
[INFO] [stdout]     |        ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 560 |     fn unreserve(&mut self, seat_number: i32) {
[INFO] [stdout]     |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished `dev` profile [unoptimized + debuginfo] target(s) in 0.19s
[INFO] running `Command { std: "docker" "inspect" "1959eccaa1f563712c7e76aa86d4d33d9ad6b3988131f9a25773c0652d341d5a", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "1959eccaa1f563712c7e76aa86d4d33d9ad6b3988131f9a25773c0652d341d5a", kill_on_drop: false }`
[INFO] [stdout] 1959eccaa1f563712c7e76aa86d4d33d9ad6b3988131f9a25773c0652d341d5a
